MSOL restricted contractibility to planar graphs
نویسندگان
چکیده
منابع مشابه
Matching and l-Subgraph Contractibility to Planar Graphs
We study the computational complexity of graph planarization via edge contraction. The problem Contract asks whether there exists a set S of at most k edges that when contracted produces a planar graph. We work with a more general problem called P -RestrictedContract in which S, in addition, is required to satisfy a fixed MSOL formula P (S,G). We give an FPT algorithm in time O(nf(k)) which sol...
متن کاملDrawing HV-Restricted Planar Graphs
A strict orthogonal drawing of a graph G = (V,E) in R is a drawing of G such that each vertex is mapped to a distinct point and each edge is mapped to a horizontal or vertical line segment. A graph G is HV -restricted if each of its edges is assigned a horizontal or vertical orientation. A strict orthogonal drawing of an HV -restricted graph G is good if it is planar and respects the edge orien...
متن کاملIntroduction to Planar Graphs
The topic of planar graphs is covered in many books and articles, but the treatment usually relies on intuition or on deep topological theorems that are quoted without proof. I give a self-contained rigorous introduction to planar graphs. 1 The Jordan curve theorem and Euler’s formula Throughout these notes graphs are allowed to have loops and multiple edges. Definition 1.1. A polygonal arc is ...
متن کاملA1-contractibility and topological contractibility
These notes are an extended transcript of two lectures given at the University of Ottawa during the workshop “Group actions, generalized cohomology theories, and affine algebraic geometry." The first lecture was a general introduction to A1-homotopy theory focusing on motivating the choice of definitions in the construction, together with a definition of A1-contractible spaces. The second lectu...
متن کاملEvaluation is MSOL-compatible
We consider simply-typed lambda calculus with fixpoint operators. Evaluation of a term gives as a result the Böhm tree of the term. We show that evaluation is compatible with monadic secondorder logic (MSOL). This means that for a fixed finite vocabulary of terms, the MSOL properties of Böhm trees of terms are effectively MSOL properties of terms themselves. Theorems of this kind have been know...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2017
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2017.02.030